approximations procedure


approximations procedure
метод последовательного приближения

Англо-русский словарь по психоаналитике. 2013.

Смотреть что такое "approximations procedure" в других словарях:

  • chemical bonding — ▪ chemistry Introduction       any of the interactions that account for the association of atoms into molecules, ions, crystals, and other stable species that make up the familiar substances of the everyday world. When atoms approach one another …   Universalium

  • Shaping (psychology) — The differential reinforcement of successive approximations, or more commonly, shaping is a conditioning procedure used primarily in the experimental analysis of behavior. It was introduced by B.F. Skinner… …   Wikipedia

  • analysis — /euh nal euh sis/, n., pl. analyses / seez /. 1. the separating of any material or abstract entity into its constituent elements (opposed to synthesis). 2. this process as a method of studying the nature of something or of determining its… …   Universalium

  • RÉELS (NOMBRES) — Par les différents adjectifs généralement accolés au substantif commun qu’est le nombre, la langue mathématique familière surprend et inquiète, car elle risque de susciter des confusions: nombres rationnels (d’autres nombres seraient donc sans… …   Encyclopédie Universelle

  • Number theory — A Lehmer sieve an analog computer once used for finding primes and solving simple diophantine equations. Number theory is a branch of pure mathematics devoted primarily to the study of the integers. Number theorists study prime numbers (the… …   Wikipedia

  • Linear cryptanalysis — In cryptography, linear cryptanalysis is a general form of cryptanalysis based on finding affine approximations to the action of a cipher. Attacks have been developed for block ciphers and stream ciphers. Linear cryptanalysis is one of the two… …   Wikipedia

  • Jacobi eigenvalue algorithm — The Jacobi eigenvalue algorithm is a numerical procedure for the calculation of all eigenvalues and eigenvectors of a real symmetric matrix. Description Let varphi in mathbb{R}, , 1 le k < l le n and let J(varphi, k, l) denote the n imes n matrix …   Wikipedia

  • Hartree-Fock — In computational physics and computational chemistry, the Hartree Fock (HF) method is an approximate method for the determination of the ground state wavefunction and ground state energy of a quantum many body system.The Hartree Fock method… …   Wikipedia

  • Durand–Kerner method — In numerical analysis, the Durand–Kerner method established 1960–66 and named after E. Durand and Immo Kerner, also called the method of Weierstrass, established 1859–91 and named after Karl Weierstrass, is a root finding algorithm for… …   Wikipedia

  • Aberth method — The Aberth method, sometimes named Aberth Ehrlich method is a root finding algorithm for simultaneous approximation of all the roots of a univariate polynomial. The fundamental theorem of algebra states that for each polynomial with complex… …   Wikipedia

  • Decomposition en valeurs singulieres — Décomposition en valeurs singulières En mathématiques, le procédé d algèbre linéaire de décomposition en valeurs singulières (ou SVD, de l anglais : Singular Value Decomposition) d une matrice est un outil important de factorisation des… …   Wikipédia en Français


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.